A climbing motion recognition method using anatomical information for screen climbing games
نویسندگان
چکیده
منابع مشابه
Motion planning of a climbing parallel robot
This paper proposes a novel application of the Stewart–Gough parallel platform as a climbing robot and its kinematics control to climb through long structures describing unknown spatial trajectories, such as palm trunks, tubes, etc. First, the description and design of the climbing parallel robot is presented. Second, the inverse and forward kinematics analysis of a mobile six-degrees-of-freedo...
متن کاملClimbing Strategy for a Flexible Tree Climbing Robot - Treebot
In this paper, we propose an autonomous tree climbing strategy for a novel tree climbing robot that is named Treebot. The proposed algorithm aims to guide Treebot in climbing along an optimal path by the use of minimal sensing resources. Inspired by inchworms, the algorithm reconstructs the shape of a tree simply by the use of tactile sensors. It reveals how the realization of an environment ca...
متن کاملDynamic Optimization of Human Stair-Climbing Motion
The objective of this paper is to present our method of predicting and simulating visually realistic and dynamically consistent human stair-climbing motion. The digital human is modeled as a 55-degrees of freedom branched mechanical system with associated human anthropometry-based link lengths, mass moments of inertia, and centers of gravity. The joint angle profiles are determined using a B-sp...
متن کاملMotion Planning of Biped Robot Climbing Stairs
The motion control of a biped robot that can climb up and down stairs is studied in this work. The algorithm generates walking patterns with desired stable margin and walking speed. Only the approximate stair height and width are required. This algorithm derives the optimal hip height and uses cubic polynomial to generate the hip and foot trajectory. The control of initial and final speeds in a...
متن کاملEfficient Routing using Class Climbing
This paper concentrates on a routing algorithm that is adaptive and avoids deadlocks and starvation. It is a general store-and-forward packet router that has been developed to be used as part of a distributed runtime system for Concurrent Clean, an experimental, lazy, higher-order parallel functional programming language based on term graph rewriting. The routing algorithm is based on the one u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Human-centric Computing and Information Sciences
سال: 2017
ISSN: 2192-1962
DOI: 10.1186/s13673-017-0106-5